Genus, Treewidth, and Local Crossing Number
نویسندگان
چکیده
منابع مشابه
Structure of Graphs with Locally Restricted Crossings
We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an n-vertex graph embedded on a surface of genus g with at most k crossings per edge has treewidth O( √ (g + 1)(k + 1)n) and layered treewidth O((g + 1)k) and that these bounds are tight up to a constant factor. In the speci...
متن کاملCrossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
We investigate crossing minimization for 1-page and 2-page book drawings. We show that computing the 1-page crossing number is fixed-parameter tractable with respect to the number of crossings, that testing 2-page planarity is fixed-parameter tractable with respect to treewidth, and that computing the 2-page crossing number is fixed-parameter tractable with respect to the sum of the number of c...
متن کاملBidimensional Parameters and Local Treewidth
For several graph theoretic parameters such as vertex cover and dominating set, it is known that if their values are bounded by k then the treewidth of the graph is bounded by some function of k. This fact is used as the main tool for the design of several fixed-parameter algorithms on minor-closed graph classes such as planar graphs, single-crossing-minor-free graphs, and graphs of bounded gen...
متن کامل-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
We give polynomial-time constant-factor approximation algorithms for the treewidth and branchwidth of any H-minor-free graph for a given graph H with crossing number at most 1. The approximation factors are 1.5 for treewidth and 2.25 for branchwidth. In particular, our result directly applies to classes of nonplanar graphs such as K5-minorfree graphs and K3,3-minor-free graphs. Along the way, w...
متن کاملA Linear Upper Bound on the Rectilinear Crossing Number
It is proved that the rectilinear crossing number of every graph with bounded tree-width and bounded degree is linear in the num-
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015